On the injective chromatic number of graphs
نویسندگان
چکیده
We define the concepts of an injective colouring and the injective chromatic number of a graph and give some upper and lower bounds in general, plus some exact values. We explore in particular the injective chromatic number of the hypercube and put it in the context of previous work on similar concepts, especially the theory of errorcorrecting codes. Finally, we give necessary and sufficient conditions for the injective chromatic number to be equal to the degree for a regular graph. Preprint submitted to Elsevier Science 12 February 2004
منابع مشابه
Injective Chromatic Sum and Injective Chromatic Polynomials of Graphs
The injective chromatic number χi(G) [5] of a graph G is the minimum number of colors needed to color the vertices of G such that two vertices with a common neighbor are assigned distinct colors. In this paper we define injective chromatic sum and injective strength of a graph and obtain the injective chromatic sum of complete graph, paths, cycles, wheel graph and complete bipartite graph. We a...
متن کاملPlanar graphs with largest injective chromatic numbers
An injective coloring of graphs is a vertex coloring where two vertices receive distinct colors if they have a common neighbor. In 1977, Wegner [12] posed a conjecture on the chromatic number of squares of graphs which remains unsolved for planar graphs with maximum degrees ∆ ≥ 4. Obviously, the chromatic number of the square of a graph is at least the injective chromatic number of a graph. We ...
متن کاملOn Injective Colourings of Chordal Graphs
We show that one can compute the injective chromatic number of a chordal graph G at least as efficiently as one can compute the chromatic number of (G−B), where B are the bridges of G. In particular, it follows that for strongly chordal graphs and so-called power chordal graphs the injective chromatic number can be determined in polynomial time. Moreover, for chordal graphs in general, we show ...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملOn the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 256 شماره
صفحات -
تاریخ انتشار 2002